Complexity, decidability and completeness

نویسندگان

  • Douglas A. Cenzer
  • Jeffrey B. Remmel
چکیده

We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory has an exponential time (EXPTIME) complete consistent extension whereas there is a nondeterministic polynomial time (NP ) decidable theory which has no polynomial time complete consistent extension when length is measured relative to the binary representation of natural numbers and formulas. It is well known that a propositional theory is axiomatizable (respectively decidable) if and only if it may be represented as the set of infinite paths through a computable tree (respectively a computable tree with no dead ends). We show that any polynomial time decidable theory may be represented as the set of paths through a polynomial time decidable tree. On the other hand, the statement that every polynomial time decidable tree represents the set of complete consistent extensions of some theory which is polynomial time decidable, relative to the tally representation of natural numbers and formulas, is equivalent to P = NP . For predicate logic, we develop a complexity theoretic version of the Henkin construction to prove a complexity theoretic version of the Completeness Theorem. Our results imply that that any polynomial space decidable theory ∆ possesses a polynomial space computable model which is exponential space decidable and thus ∆ has an exponential space complete consistent extension. Similar results are obtained for other notions of complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient reasoning about actions based on assignments and announcements

We propose a reasoning about actions framework based on a combination of epistemic logic and star-free PDL, into which we integrate Reiter’s solution to the frame problem. We then show that prediction (alias plan verification) can be reduced in polynomial time to dynamic epistemic logic with assignments that has recently been proposed by Kooi et al.. We establish decidability and complexity res...

متن کامل

Reducing Modal Consequence Relations

In this paper we will investigate the possibility of reducing derivability in a modal consequence relation to consistency in unimodal and polymodal K by means of so–called reduction functions. We will present new and easy methods to prove standard results on decidability, complexity, finite model property, interpolation and Halldén–completeness using only the reduction functions. Some new resul...

متن کامل

Reasoning About Sequences of Memory States

Motivated by the verification of programs with pointer variables, we introduce a temporal logic LTL whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTL, considering various fragments of...

متن کامل

Reasoning about sequences of memory states ( preliminary version ) ?

In order to verify programs with pointer variables, we introduce a temporal logic LTL whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We state the complexity of various model-checking and satisfiability problems for LTL, considering various fragments of separation logi...

متن کامل

Completeness and Decidability Results for CTL in Coq

We prove completeness and decidability results for the temporal logic CTL in Coq/Ssreflect. Our basic result is a constructive proof that for every formula one can obtain either a finite model satisfying the formula or a proof in a Hilbert system certifying the unsatisfiability of the formula. The proof is based on a history-augmented tableau system obtained as the dual of Brünnler and Lange’s ...

متن کامل

ALPS’07 – Groups and Complexity

The connection between groups and recursive (un)decidability has a long history, going back to the early 1900s. Also, various polynomial-time algorithms have been known in group theory for a long time. However the impact of more general computational complexity (e.g., NP-completeness or PSpace-completeness) has been relatively small and recent. These lectures review a sampling of older facts ab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2006